package com.example.leetcode.trainingcamp.week10.thursday;

public class Test309 {

    public int maxProfit(int[] prices) {
        int n = prices.length;
        // dp[i][0]第i天持有股票的收益，dp[i][1]第i不持有股票并且处于冷冻期,dp[i][2]第i天不持有股票并且不在冷冻期
        int[][] dp = new int[n][3];
        dp[0][0] = -prices[0];
        for (int i =1;i<n;i++){
            dp[i][0] = Math.max(dp[i-1][0],dp[i-1][2]-prices[i]);
            dp[i][1] = dp[i-1][0] + prices[i];
            dp[i][2] = Math.max(dp[i-1][1],dp[i-1][2]);
        }
        return Math.max(dp[n-1][1],dp[n-1][2]);
    }
}
